Cache-Aided Private Information Retrieval With Partially Known Uncoded Prefetching: Fundamental Limits
نویسندگان
چکیده
منابع مشابه
Cache-Aided Private Information Retrieval with Partially Known Uncoded Prefetching
We consider the problem of private information retrieval (PIR) from N non-colluding and replicated databases, when the user is equipped with a cache that holds an uncoded fraction r from each of the K stored messages in the databases. This model operates in a two-phase scheme, namely, the prefetching phase where the user acquires side information and the retrieval phase where the user privately...
متن کاملCache-Aided Private Information Retrieval with Partially Known Uncoded Prefetching: Fundamental Limits
We consider the problem of private information retrieval (PIR) from N non-colluding and replicated databases, when the user is equipped with a cache that holds an uncoded fraction r of the symbols from each of the K stored messages in the databases. This model operates in a two-phase scheme, namely, the prefetching phase where the user acquires side information and the retrieval phase where the...
متن کاملFundamental Limits of Cache-Aided Private Information Retrieval with Unknown and Uncoded Prefetching
We consider the problem of private information retrieval (PIR) fromN non-colluding and replicated databases when the user is equipped with a cache that holds an uncoded fraction r from each of the K stored messages in the databases. We assume that the databases are unaware of the cache content. We investigate D∗(r) the optimal download cost normalized with the message size as a function of K, N...
متن کاملPrivate Information Retrieval with Partially Known Private Side Information
We consider the problem of private information retrieval (PIR) of a single message out of K messages from N replicated and non-colluding databases where a cache-enabled user of cache-size M messages possesses side information in the form of full messages that are partially known to the databases. In this model, the user and the databases engage in a two-phase scheme, namely, the prefetching pha...
متن کاملThe Capacity of Private Information Retrieval with Partially Known Private Side Information
We consider the problem of private information retrieval (PIR) of a single message out of K messages from N replicated and non-colluding databases where a cacheenabled user (retriever) of cache-size M possesses side information in the form of full messages that are partially known to the databases. In this model, the user and the databases engage in a two-phase scheme, namely, the prefetching p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Selected Areas in Communications
سال: 2018
ISSN: 0733-8716,1558-0008
DOI: 10.1109/jsac.2018.2844940